Non‐blocking two‐phase commit using blockchain
نویسندگان
چکیده
منابع مشابه
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
We introduce quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on “quit” if failures occur, and we relate this problem to the well-known problem of non-blocking atomic commit. We then determine the weakest failure detectors for these two problems in all environments, regardless of the number of faulty processes.
متن کاملReimagining KYC Using Blockchain Technology
The Know Your Customer (KYC) process is an integral part of client onboarding and requires banks to validate and verify primary documents. The market today, though, is flooded with KYC utilities that help manage these documents and share them with multiple entities, but they provide little value addition. Blockchain technology, with its concept of distributed, time-stamped ledgers, can effectiv...
متن کاملNonblocking Control of Petri Nets Using Unfolding
We deal with the problem of controlling a safe place/transition nets so as to avoid a set of forbidden markings F . If a given set of markings has property REACH, i.e., if it is closed under the reachability operator, using the technique of unfolding it is possible to efficiently design a maximally permissive supervisor to solve this control problem. We consider the additional problem of forbid...
متن کاملConstructing Atomic Commit Protocols Using Knowledge
use logic of process knowledge as a tool to (1) tomic commit problem, to (2) analyze at a rather correct atomic commit protocols that are in use and construction of atomic commit protocols. This e formal definitions are introduced and used in the for people not familiar with logic of process rotocols. ment in supporting global atomicity of distributed (2PC) is the de facto standard atomic commi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2019
ISSN: 1532-0626,1532-0634
DOI: 10.1002/cpe.5276